Boolean Semantics and Categorial Polyvalency
نویسنده
چکیده
Boolean semantics is a version of formal semantics in which models are supposed to have algebraic, preferably Boolean, structure (Keenan and Faltz 1985). Thus for any category C there is a corresponding denotational Boolean algebra DC of possible denotations of expressions of category C. Furthermore, given that most categories are functionally related (in principle all ”major” categories are Boolean), the corresponding denotational algebras are not independent of each other. In particular the algebra DA/B has as elements functions from DB to DA. Given that functions interpreting functional expressions may satisfy various ”universal” constraints, we will usually consider just some sub-algebras of the algebra of all functions from DB to DA. An important feature of denotational algebrasDC is that they are atomic. This means that any element different from the zero of the algebra contains an atom. An atom is an element which contains only itself and the zero element. Atoms of the algebra DA/B are determined by atoms and/or elements of the resulting algebraDA. Obviously the binary algebra {0, 1} has only one atom. This is the element corresponding to truth. Thus atoms of denotational algebras of functional expressions are eventually defined by truth. Let me illustrate this point by the atomicity of DA/B in the case when there are no constraints on functions from DA on DB . In this case atomicity of DA/B is inherited from the atomicity of DA. More precisely atoms of DA/B are determined by atoms of DA in the following way (Zuber 2001):
منابع مشابه
Some modifiers of conditionals
Conditional sentences are difficult to analyse and the literature on this topic is so abundant that I do not dare to mention any title except for those mentioned for the specific purposes of this paper. The difficulty starts already at classificational and typological levels. The purpose of this paper is to analyse conditional sentences (CSs, for short) in which specific items, so-called catego...
متن کاملPolymorphism in English Logical Grammar
The quantifiers and connectives of English present difficulties to standard (Church-style) type theory in linguistics in that they can apply systematically to objects of different form. This paper sketches solutions to this problem with some extensions to the simply typed lambda calculus, including Damas-Milner types and System F or the polymorphic lambda calculus. The goal is to maintain the “...
متن کاملA Categorial Approach to the Combination of Logics1
In this paper we propose a very general deenition of combination of logics by means of the concept of sheaves of logics. We rst discuss some properties of this general deenition and list some problems, as well as connections to related work. As applications of our abstract setting, we show that the notion of possible-translations semantics, introduced in previous papers by the rst author, can b...
متن کاملTerm satisfiability in FLew-algebras
FLew-algebras form the algebraic semantics of the full Lambek calculus with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FLew-terms and FLew-algebras. For each FLew-algebra, the sets of its satisfiable and positively satisfiable terms can be viewed as fragments of its existential theory; we identify and investigate the compleme...
متن کاملCategorial grammar, modalities and algebraic semantics
This paper contributes to the theory of substructural logics .that are of interest to categorial grammarians. Combining semantic ideas of Hepple [1990] and Mor-rill [1990], proof-theoretic ideas of Venema [1993b; 1993a] and the theory of equational specifications, a class of resource-preserving logics is defined, for which decidability and completeness theorems are established.
متن کامل